Fully Homomorphic Encryption in Real World Applications by Ayantika Chatterjee & Khin Mi Mi Aung

Author:Ayantika Chatterjee & Khin Mi Mi Aung
Language: eng
Format: epub
ISBN: 9789811363931
Publisher: Springer Singapore

4.9 Design of Encrypted Queue

In the ADT queue, the entities in the collection are kept in order. The basic difference of stack with queue is that stack elements are LIFO (Last In First Out) based, whereas queue elements are FIFO (First In First Out) based. Hence, queues unlike stack requires two pointers rear (the end where data is inserted or enqueued) and front (from where data is extracted or dequeued). However, front and rear should also be encrypted, since we are discussing about encrypted queue. Further encrypted enqueue is very similar operation with pushing data into the encrypted stack, similarly encrypted dequeue operation resembles pop operation from encrypted stack. However, in this case enqueue operation modifies the encrypted rear value, while the deque operation modifies the encrypted front value.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.